SIAM Journal on Computing -- 1990

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Computing

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 19, Issue 6, pp. 989-1161

Please Note: Electronic articles are available well in advance of the printed articles.

An Improved Algorithm For Approximate String Matching

Zvi Galil and Kunsoo Park

pp. 989-999

BibTeX Abstract Full Text: PDF

Linear Programming with Two Variables Per Inequality in Poly-Log Time

George S. Lueker, Nimrod Megiddo, and Vijaya Ramachandran

pp. 1000-1010

BibTeX Abstract Full Text: PDF

A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata

Cynthia Dwork and Larry Stockmeyer

pp. 1011-1023

BibTeX Abstract Full Text: PDF

The Searchlight Scheduling Problem

Kazuo Sugihara, Ichiro Suzuki, and Masafumi Yamashita

pp. 1024-1040

BibTeX Abstract Full Text: PDF

Minimum Cuts for Circular-Arc Graphs

D. T. Lee, M. Sarrafzadeh, and Y. F. Wu

pp. 1041-1050

BibTeX Abstract Full Text: PDF

An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm

Dany Breslauer and Zvi Galil

pp. 1051-1058

BibTeX Abstract Full Text: PDF

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields

Dima Yu. Grigoriev, Marek Karpinski, and Michael F. Singer

pp. 1059-1063

BibTeX Abstract Full Text: PDF

Linear Circuits over $\operatorname{GF}(2)$

Noga Alon, Mauricio Karchmer, and Avi Wigderson

pp. 1064-1067

BibTeX Abstract Full Text: PDF

Random Polynomials and Approximate Zeros of Newton's Method

pp. 1068-1099

BibTeX Abstract Full Text: PDF

Category and Measure in Complexity Classes

pp. 1100-1131

BibTeX Abstract Full Text: PDF

Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation

pp. 1132-1161

BibTeX Abstract Full Text: PDF